On Classical and Quantum MDS-Convolutional BCH Codes

نویسنده

  • Giuliano G. La Guardia
چکیده

Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem (BCH) codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum convolutional codes are optimal in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search. Index Terms – convolutional codes, quantum convolutional codes, MDS codes, cyclic codes

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Quantum and Classical Error Control Codes: Constructions and Applications

It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor’s algorithm is able to factor large integers in polynomial time on a quantum computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a formidable task to build a quantum computer, since...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Asymmetric and Symmetric Subsystem BCH Codes and Beyond

Recently, the theory of quantum error control codes has been extended to subsystem codes over symmetric and asymmetric quantum channels – qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetric quantum channels. In this paper, we develop a theory and establish the conne...

متن کامل

Convolutional Codes Derived From Group Character Codes

Constructions of (classical) convolutional codes and their corresponding properties have been presented in the literature [1, 3–8, 12, 15–20]. In [3], the author constructed an algebraic structure for convolutional codes. Addressing the construction of maximum-distance-separable (MDS) convolutional codes (in the sense that the codes attain the generalized Singleton bound introduced in [18, Theo...

متن کامل

On Negacyclic MDS-Convolutional Codes

New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014